Network Efficient QoS Routing for Multimedia Services in MPLS Networks

This dissertation investigates the single path calculation in order to satisfy the load balancing of the traffic. Today's Internet is a best effort service based on a single metric path selecting algorithm that can only support path for one requirement. Traffic is sent according to the selected path whatever the type of service is served. Various network services such as multimedia traffic require different quality-of-service (QoS). The Internet Engineering Task Force (IETF) has proposed many service models and mechanisms to meet the demand for QoS. Multiprotocol label switching(MPLS) received attention in many studies for its usefulness in supporting multiple protocol and fast transmission and the ability of reserving and controlling paths. MPLS is also a useful tool in traffic engineering. In order to support QoS call, path is subject to multiple constraints on routing metric. In many cases, the path finding problem is NP-complete. This dissertation proposes a routing algorithm that finds a feasible path in polynomial time. The algorithm uses cost metric that is based on delay metric and influenced by resource bandwidth metric and network state for vii traffic distribution. The use of dynamic network status enables the algorithm to cope with the network situation. The algorithm uses shortest path when network load is light and performs traffic engineering by moving to alternate path when network link is crowded. The routing algorithm is implemented in routing server architecture and proposed routing manager structure. The routing process follows the constraint based routing for MPLS network to serve QoS and best-effort traffic. The performance is compared with other routing algorithms through simulation .